from collections import defaultdict as dd
from collections import deque
import bisect
import heapq
def ri():
return int(input())
def rl():
return list(map(int, input().split()))
def solve():
n = ri()
lo = 1
hi = (n + 2) // 2
ans = []
for i in range(n // 2):
ans.extend([hi, lo])
hi += 1
lo += 1
if n % 2: ans.append(n)
print (*ans)
mode = 'T'
if mode == 'T':
t = ri()
for i in range(t):
solve()
else:
solve()
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define endl "\n"
#define intt __int128_t
#define all(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define x first
#define y second
int main() {
fast_cin();
ll t;
cin >> t;
while(t--){
ll n;
cin >> n;
if (n < 4){
for (int i = 1; i <= n; i++){
cout << i << " ";
}
cout << endl;
continue;
}
if (n == 4){
cout << "2 4 1 3" << endl;
continue;
}
for (int i = 1; i <= n/2 + n%2; i++){
if (n%2 == 1){
cout << i << " ";
if (i <= n/2){
cout << i + n/2 + n%2 << " ";
}
} else {
cout << i + n/2 + n%2 << " " << i << " ";
}
}
cout << endl;
}
return 0;
}
41C - Email address | 1373D - Maximum Sum on Even Positions |
1574C - Slay the Dragon | 621A - Wet Shark and Odd and Even |
1395A - Boboniu Likes to Color Balls | 1637C - Andrew and Stones |
1334B - Middle Class | 260C - Balls and Boxes |
1554A - Cherry | 11B - Jumping Jack |
716A - Crazy Computer | 644A - Parliament of Berland |
1657C - Bracket Sequence Deletion | 1657B - XY Sequence |
1009A - Game Shopping | 1657A - Integer Moves |
230B - T-primes | 630A - Again Twenty Five |
1234D - Distinct Characters Queries | 1183A - Nearest Interesting Number |
1009E - Intercity Travelling | 1637B - MEX and Array |
224A - Parallelepiped | 964A - Splits |
1615A - Closing The Gap | 4C - Registration System |
1321A - Contest for Robots | 1451A - Subtract or Divide |
1B - Spreadsheet | 1177A - Digits Sequence (Easy Edition) |